n 16造句

• Proceed through 16 iterations , for 1 n 16 , using a function f which operates on two blocks - a data block of 32 bits and a key kn of 48 bits - to produce a block of 32 bits
  我们会将ike和ipsec与现有的mac策略进行集成。因为这一工作实际上已经开始了，我们将有更多可以谈论的。 ”
• We also calculate the average crossing number aac ( n ) of all of the 4 - regular graphs for n < 12 and the average crossing number arc ( n ) of some random 4 - regular graphs of degree 4 for n < 16 . at the end of the paper , a conjecture that the average crossing number of regular graph of degree 4 is o ( n2 ) is given
  同时计算出n 12的所有四正则图的平均交叉数aac ( n ) ，和n 16的随机四正则图的平均交叉数arc ( n ) ，并根据计算结果提出四正则图的平均交叉数为o ( n ~ 2 )的猜想。
• By the algorithm ccn , we investigate the crossing numbers of regular graphs with small order . we get the crossing numbers of 3 - regular graphs for n < 16 and 4 - regular graphs for n < 12 , and the lower bounds of the maximum crossing numbers of 3 - regular graphs for n < 30 and 4 - regular graphs for n < 19 , where n is the order of graphs . according to the result , we put forward the conjecture about the maximum crossing numbers of regular graphs
  本文还利用算法ccn ( calculatecrossingnumber )对顶点数较小的正则图的交叉数进行研究，计算出n 16的三正则图和n 12的四正则图的交叉数，以及n 30的三正则图和n 19的四正则图的最大交叉数的下限( n为图的顶点个数) ，根据计算结果提出关于正则图最大交叉数的猜想。